Accelerating Interactive Evolutionary Algorithms through Comparative and Predictive User Models

ثبت نشده
چکیده

Interactive Evolutionary Algorithms (IEAs) are a powerful explorative search technique that utilizes human input to make subjective decisions on potential problem solutions. But humans are much slower than computers and get bored and tired easily, limiting the usefulness of IEAs. Here two variations of a user-modeling approach are compared to determine if this approach can accelerate IEA search. The IEA system used for these comparisons is called The Approximate User (TAU). With TAU, as the user interacts with the IEA a model of the user’s preferences is constructed and continually refined. The two user-modeling approaches compared are: 1. learning a classifier which correctly determines which of two designs is better; and 2. learning a model which predicts a fitness score. Rather than having people do the user-testing, we propose the use of a simulated user as an easier means to test IEAs. The TAU IEA and both variants of its user models is compared against a basic IEA and it is shown that TAU is up to 2.7 times faster and 15 times more reliable at producing near optimal results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monterey Mirror: Combining Markov Models, Genetic Algorithms, and Power Laws An Experiment in Interactive Evolutionary Music Performance

Monterey Mirror is an interactive stochastic music generator based on Markov models, genetic algorithms, and power-law metrics for music information retrieval. It combines the predictive power of Markov models with the innovative power of genetic algorithms, using power-law metrics for fitness evaluation. These metrics have been developed and refined in a decade-long project, which explores mus...

متن کامل

Learning Comparative User Models for Accelerating Human-Computer Collaborative Search

Interactive Evolutionary Algorithms (IEAs) are a powerful explorative search technique that utilizes human input to make subjective decisions on potential problem solutions. But humans are slow and get bored and tired easily, limiting the usefulness of IEAs. Here we describe our system which works toward overcoming these problems, The Approximate User (TAU), and also a simulated user as a means...

متن کامل

Optimization of sediment rating curve coefficients using evolutionary algorithms and unsupervised artificial neural network

Sediment rating curve (SRC) is a conventional and a common regression model in estimating suspended sediment load (SSL) of flow discharge. However, in most cases the data log-transformation in SRC models causing a bias which underestimates SSL prediction. In this study, using the daily stream flow and suspended sediment load data from Shalman hydrometric station on Shalmanroud River, Guilan Pro...

متن کامل

Novel Hybrid Fuzzy-Evolutionary Algorithms for Optimization of a Fuzzy Expert System Applied to Dust Phenomenon Forecasting Problem

Nowadays, dust phenomenon is one of the important challenges in warm and dry areas. Forecasting the phenomenon before its occurrence helps to take precautionary steps to prevent its consequences. Fuzzy expert systems capabilities have been taken into account to assist and cope with the uncertainty associated to complex environments such as dust forecasting problem. This paper presents novel hyb...

متن کامل

An Experimental Comparative Study for Interactive Evolutionary Computation Problems

This paper presents an objective experimental comparative study between four algorithms: the Genetic Algorithm, the Fitness Prediction Genetic Algorithm, the Population Based Incremental Learning algorithm and the purposed method based on the Chromosome Appearance Probability Matrix. The comparative is done with a non subjective evaluation function. The main objective is to validate the efficie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012